Modal Logic and the Approximation Induction Principle
نویسندگان
چکیده
We prove a compactness theorem in the context of Hennessy–Milner logic. It is used to derive a sufficient condition on modal characterizations for the Approximation Induction Principle to be sound modulo the corresponding process equivalence. We show that this condition is necessary when the equivalence in question is compositional with respect to the projection operators. Furthermore, we derive different upper bounds for the constructive version of Approximation Induction Principle with respect to simulation and decorated trace semantics.
منابع مشابه
On Modal Characterizations and Turning GSOS Rules Into Equations
In this thesis properties of various process equivalences are analysed, specifically definability with finite HML formulas, soundness of the Approximation Induction Principle and properties of processes that are regular with respect to a given equivalence. Also it is explained how to adapt the existing axiomatisation strategy for bisimulation so that it works for other common equivalences as we...
متن کاملCoalgebraic modal logic: soundness, completeness and decidability of local consequence
This paper studies finitary modal logics, interpreted over coalgebras for an endofunctor, and establishes soundness, completeness and decidability results. The logics are studied within the abstract framework of coalgebraic modal logic, which can be instantiated with arbitrary endofunctors on the category of sets. This is achieved through the use of predicate liftings, which generalise atomic p...
متن کاملSuhrawardi's Modal Syllogisms
Suhrawardi’s logic of the Hikmat al-Ishraq is basically modal. So to understand his modal logic one first has to know the non-modal part upon which his modal logic is built. In my previous paper ‘Suhrawardi on Syllogisms’(3) I discussed the former in detail. The present paper is an exposition of his treatment of modal syllogisms. On the basis of some reasonable existential presuppositi...
متن کاملCompleteness of Kozen's Axiomatization for the Modal mu-Calculus: A Simple Proof
The modal μ-calculus, introduced by Dexter Kozen, is an extension of modal logic with fixpoint operators. Its axiomatization, Koz, was introduced at the same time and is an extension of the minimal modal logic K with the so-called Park fixpoint induction principle. It took more than a decade for the completeness of Koz to be proven, finally achieved by Igor Walukiewicz. However, his proof is fa...
متن کاملModal logic approach to preferred bases in the quantum universe
We present a modal logic based approach to the endophysical quantum universe. In particular, we treat the problem of preferred bases and that of state reduction by employing an eclectic collection of relatively novel methods including Baltag’s analytic non-wellfounded set theory, a modal logic interpretation of Dempster-Shafer theory, and results from the theory of isometric embeddings of discr...
متن کامل